Harnessing parallel disks to solve Rubik's cube
نویسندگان
چکیده
The number ofmoves required to solve any configuration of Rubik’s cube has held a fascination for over 25 years. A new upper bound of 26 is produced. More important, a new methodology is described for finding upper bounds. The novelty is two-fold. First, parallel disks are employed. This allows 1.4 × 1012 states representing symmetrized cosets to be enumerated in seven terabytes. Second, a faster table-based multiplication is described for symmetrized cosets that attempts to keep most tables in the CPU cache. This enables the product of a symmetrized coset by a generator at a rate of 10 million moves per second. © 2008 Published by Elsevier Ltd
منابع مشابه
A Program That Learns to Solve Rubik's Cube
This paper dcscribcs a program which learns efficient strategies for solving problems such as Rubik’s cube and the eight puzzle. It uses a new gcncral problem solving method based on macro-operators. The strategies learned by the program are equal to or superior to strategies used by humans on these problems, in terms of number of moves rcquircd for solution.
متن کاملTwenty-Five Moves Suffice for Rubik's Cube
How many moves does it take to solve Rubik’s Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or more moves; this is a surprisingly large gap. This paper describes a program that is able to find solutions of length 20 or less at a rate of more than 16 million positions a second. We use this program, along with some new id...
متن کاملApplications of Cayley Graphs
This paper demonstrates the power of the Cayley graph approach to solve specific applications , such as rearrangement problems and the design of interconnection networks for parallel CPU's. Recent results of the authors for efficient use of Cayley graphs are used here in exploratory analysis to extend recent results of Babai et al. on a family of trivalent Cayley graphs associated with P SL 2 (...
متن کاملZero Knowledge with Rubik's Cubes
Since the invention of the Rubik’s cube by Ernö Rubik in 1974, similar puzzles have been produced, with various number of faces or stickers. We can use these toys to define several problems in computer science, such as go from one state of the puzzle to another one. In this paper, we will classify some of these problems based on the classic Rubik’s cube or on generalized Rubik’s Cube. And we wi...
متن کاملGroup Theory and the Rubik’s Cube
A Note to the Reader These notes are based on a 2-week course that I taught for high school students at the Texas State Honors Summer Math Camp. All of the students in my class had taken elementary number theory at the camp, so I have assumed in these notes that readers are familiar with the integers mod n as well as the units mod n. Because one goal of this class was a complete understanding o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 44 شماره
صفحات -
تاریخ انتشار 2009